Semistar Operations and Standard Closure Operations
نویسندگان
چکیده
منابع مشابه
Local–global Properties for Semistar Operations
We study the “local” behavior of several relevant properties concerning semistar operations, like finite type, stable, spectral, e.a.b. and a.b. We deal with the “global” problem of building a new semistar operation on a given integral domain, by “gluing” a given homogeneous family of semistar operations defined on a set of localizations. We apply these results for studying the local–global beh...
متن کاملUppers to Zero and Semistar Operations in Polynomial Rings
Given a stable semistar operation of finite type ⋆ on an integral domain D, we show that it is possible to define in a canonical way a stable semistar operation of finite type [⋆] on the polynomial ring D[X], such that D is a ⋆-quasi-Prüfer domain if and only if each upper to zero in D[X] is a quasi-[⋆]-maximal ideal. This result completes the investigation initiated by Houston-Malik-Mott [18, ...
متن کاملNagata Rings, Kronecker Function Rings and Related Semistar Operations
In 1994, Matsuda and Okabe introduced the notion of semistar operation. This concept extends the classical concept of star operation (cf. for instance, Gilmer’s book [20]) and, hence, the related classical theory of ideal systems based on the works by W. Krull, E. Noether, H. Prüfer and P. Lorenzen from 1930’s. In [17] and [18] the current authors investigated properties of the Kronecker functi...
متن کاملClosure operations in phylogenetics.
Closure operations are a useful device in both the theory and practice of tree reconstruction in biology and other areas of classification. These operations take a collection of trees (rooted or unrooted) that classify overlapping sets of objects at their leaves, and infer further tree-like relationships. In this paper we investigate closure operations on phylogenetic trees; both rooted and unr...
متن کاملClosure Systems and Closure Operations in Dedekind
The concepts of closure systems and closure operations in lattice theory are basic and applied to many fields in mathematics and theoretical computer science. In this paper authors find out a suitable definition of closure systems in Dedekind categories, and thereby give an equivalence proof for closure systems and closure operations in Dedekind categories.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2014
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2014.897589